package arithmetic.leecode_arthmetic;

/**
 * 环形
 * describe:给你单链表的头节点 head ，请你反转链表，并返回反转后的链表。。
 * url:<a href="https://leetcode.cn/problems/linked-list-cycle/?envType=study-plan-v2&envId=top-100-liked></a>
 */
public class Solution141 {

    public boolean hasCycle(ListNode head) {

        return false;
    }

    private class ListNode {
        int val;
        Solution141.ListNode next;

        ListNode() {
        }

        ListNode(int val) {
            this.val = val;
        }

        ListNode(int val, Solution141.ListNode next) {
            this.val = val;
            this.next = next;
        }
    }
}
